Von Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching
نویسندگان
چکیده
We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von Neumann-Morgenstern farsightedly stable set if and only if it is a singleton set and its element is a corewise stable matching. Thus, contrary to the von Neumann-Morgenstern (myopically) stable sets, von Neumann-Morgenstern farsightedly stable sets cannot include matchings that are not corewise stable ones. Moreover, we show that our main result is robust to manyto-one matching problems with responsive preferences. JEL Classi cation: C71, C78. Key words: Matching problem, von Neumann-Morgenstern stable sets, Farsighted Stability. Ana Mauleon and Vincent Vannetelbosch are Research Associates of the National Fund for Scienti c Research (FNRS), Belgium. Vincent Vannetelbosch is Associate Fellow of CEREC, Facultés Universitaires Saint-Louis. Corresponding author: Prof. Vincent Vannetelbosch, CORE, University of Louvain, 34 voie du Roman Pays, B-1348 Louvain-la-Neuve, Belgium (e-mail: [email protected])
منابع مشابه
Farsighted Stability for Roommate Markets∗
Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this characterization of indirect dominance, we investigate von Neumann-Morgenstern farsightedly stable sets. We show that a singleton is von Neumann-Morgenster...
متن کاملFarsighted House Allocation
In this note we study von Neumann-Morgenstern farsightedly stable sets for Shapley and Scarf (1974) housing markets. Kawasaki (2008) shows that the set of competitive allocations coincides with the unique von Neumann-Morgenstern stable set based on a farsighted version of antisymmetric weak dominance (cf., Wako, 1999). We demonstrate that the set of competitive allocations also coincides with t...
متن کاملCoalition Formation among Farsighted Agents
A set of coalition structures P is farsightedly stable (i) if all possible deviations from any coalition structure p belonging to P to a coalition structure outside P are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improving path from any coalition structure outside the set leading to some coalition structure in the set, and (iii) if there i...
متن کاملVon Neumann-Morgenstern stable sets in matching problems
The following properties of the core of a one-to-one matching problem are well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characteriz...
متن کاملVon Neumann–Morgenstern stable-set solutions in the assignment market
Existence of von Neumann–Morgenstern solutions (stable sets) is proved for any assignment game. For each optimal matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with this matching. All these stable sets exclude third-party payments and form a lattice with respect to the same partial order usually defined on the core.
متن کامل